Optimal rank-based tests for Common Principal Components
نویسندگان
چکیده
منابع مشابه
Optimal Rank-Based Tests for Common Principal Components
This paper provides optimal testing procedures for the m-sample null hypothesis of Common Principal Components (CPC) under possibly non Gaussian and heterogenous elliptical densities. We first establish, under very mild assumptions that do not require finite moments of order four, the local asymptotic normality (LAN) of the model. Based on that result, we show that the pseudo-Gaussian test prop...
متن کاملOptimal Rank-based Testing for Principal Components
This paper provides parametric and rank-based optimal tests for eigenvectors and eigenvalues of covariance or scatter matrices in elliptical families. The parametric tests extend the Gaussian likelihood ratio tests of Anderson (1963) and their pseudo-Gaussian robustifications by Tyler (1981, 1983) and Davis (1977), with which their Gaussian versions are shown to coincide, asymptotically, under ...
متن کاملRobust tests for the common principal components model
In multivariate analysis we often deal with situations involving several populations, such as discriminant analysis, where the assumption of equality of scatter matrices is usually assumed. Yet sometimes, this assumption is not adequate but problems related to an excessive number of parameters will arise if we estimate the scatter matrices separately for each population. In many practical situa...
متن کاملOptimal Rank - Based Tests for Sphericity
We propose a class of rank-based procedures for testing that the shape matrix V of an elliptical distribution (with unspecified center of symmetry, scale, and radial density) has some fixed value V0; this includes, for V0 = Ik, the problem of testing for sphericity as an important particular case. The proposed tests are invariant under translations, monotone radial transformations, rotations, a...
متن کاملOptimal signed-rank tests based on hyperplanes
For analysing k-variate data sets, Randles (1989) considered hyperplanes going through k− 1 data points and the origin. He then introduced an empirical angular distance between two k-variate data vectors based on the number of hyperplanes (the so-called interdirections) that separate these two points, and proposed a multivariate sign test based on those interdirections. In this paper, we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2013
ISSN: 1350-7265
DOI: 10.3150/12-bej461